Ela on Nonnegative Sign Equivalent and Sign Similar Factorizations of Matrices∗

نویسندگان

  • DANIEL HERSHKOWITZ
  • ALLAN PINKUS
چکیده

Dedicated to Hans Schneider on the occasion of his eightieth birthday Abstract. It is shown that every real n×n matrix is a product of at most two nonnegative sign equivalent matrices, and every real n × n matrix, n ≥ 2, is a product of at most three nonnegative sign similar matrices. Finally, it is proved that every real n×n matrix is a product of totally positive sign equivalent matrices. However, the question of the minimal number of such factors is left open.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Sign-Real Spectral Radius for Real Tensors

In this paper a new quantity for real tensors, the sign-real spectral radius, is defined and investigated. Various characterizations, bounds and some properties are derived. In certain aspects our quantity shows similar behavior to the spectral radius of a nonnegative tensor. In fact, we generalize the Perron Frobenius theorem for nonnegative tensors to the class of real tensors.

متن کامل

PERRON-FROBENIUS THEORY ON THE NUMERICAL RANGE FOR SOME CLASSES OF REAL MATRICES

We give further results for Perron-Frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. We indicate two techniques for establishing the main theorem ofPerron and Frobenius on the numerical range. In the rst method, we use acorresponding version of Wielandt's lemma. The second technique involves graphtheory.

متن کامل

Ela Variational Characterizations of the Sign-real and the Sign-complex Spectral Radius∗

The sign-real and the sign-complex spectral radius, also called the generalized spectral radius, proved to be an interesting generalization of the classical Perron-Frobenius theory (for nonnegative matrices) to general real and to general complex matrices, respectively. Especially the generalization of the well-known Collatz-Wielandt max-min characterization shows one of the many one-to-one cor...

متن کامل

Ela Binary Ranks and Binary Factorizations of Nonnegative Integer Matrices

Abstract. A matrix is binary if each of its entries is either 0 or 1. The binary rank of a nonnegative integer matrix A is the smallest integer b such that A = BC, where B and C are binary matrices, and B has b columns. In this paper, bounds for the binary rank are given, and nonnegative integer matrices that attain the lower bound are characterized. Moreover, binary ranks of nonnegative intege...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007